Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("COMPUTER THEORY")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 9500

  • Page / 380
Export

Selection :

  • and

LES ESPACES DE CALCULS A COMMANDE ITERATIVESKRZYPKOWSKI T.1976; PRACE C.O. P.A.N.; POLSKA; DA. 1976; NO 249; PP. 1-29; ABS. ANGL. RUSSE; BIBL. 4 REF.Serial Issue

BIBLIOGRAPHY OF L SYSTEMS.ROZENBERG G; PENTTONEN M; SALOMAA A et al.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977 PARU 1978; VOL. 5; NO 3; PP. 339-354Article

ISOMORPHISM, FORM EQUIVALENCE AND SEQUENCE EQUIVALENCE OF PDOL FORMS.CULIK K II; MAURER HA; OTTMANN T et al.1978; THEOR. COMPUTER SCI.; NETHERL.; DA. 1978; VOL. 6; NO 2; PP. 143-173; BIBL. 5 REF.Article

THE DENSEST HEMISPHERE PROBLEM.JOHNSON DS; PREPARATA FP.1978; THEOR. COMPUTER SCI.; NETHERL.; DA. 1978; VOL. 6; NO 1; PP. 93-107; BIBL. 4 REF.Article

A CONSTRUCTIVE CHARACTERIZATION OF THE LATTICES OF ALL RETRACTIONS, PRECLOSURE, QUASI-CLOSURE AND CLOSURE OPERATORS ON A COMPLETE LATTICECOUSOT P; COUSOT R.1978; MATH. APPL. INFORMAT., RAPP. RECH.; FRA; DA. 1978; NO 128; PP. 1-15; BIBL. 1 P.Serial Issue

UTILISATION DES LANGAGES FORMELS EN THEORIE DES CHAMPS.CALMET J.1977; BULL. SOC. MATH. FR., SUPPL.; FR.; DA. 1977; PP. 31-39; BIBL. 15 REF.; (UTIL. CALE MATH. PURES. JOURN. CONF.; LIMOGES; 1975)Conference Paper

SYSTEMATIC APPROACH TO REDUCTION AND MINIMIZATION IN AUTOMATA AND SYSTEM THEORY.EHRIG H; KREOWSKI HJ.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 12; NO 3; PP. 269-304; BIBL. 1 P. 1/2Article

FRONTIERS OF INFINITE TREES.COURCELLE B.1978; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1978; NO 272; PP. 1-26; ABS. FR.; BIBL. 6 REF.Serial Issue

A NOTE ON EQUAL POWERS OF WORD MORPHISMS.RUOHONEN K.1977; R.A.I.R.O. INFORMAT. THEOR.; FR.; DA. 1977; VOL. 11; NO 3; PP. 207-211; BIBL. 4 REF.Article

UPRAVLENIE INFORMATSIYA INTELLEKT. = COMMANDE. INFORMATION. INTELLIGENCEBERGA AI; BIRYUKOVA BV; GELLERA ES et al.1976; MOSKVA; MYSL; DA. 1976; PP. 1-383; BIBL. DISSEM.Book

APPROXIMATE REDUCTION AND LAMBDA CALCULUS MODELS.WADSWORTH CP.1978; S.I.A.M.J. COMPUTG; USA; DA. 1978; VOL. 7; NO 3; PP. 337-356; BIBL. 13 REF.Article

ON A QUESTION OF S. EILENBERG.REUTENAUER C.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977 PARU 1978; VOL. 5; NO 2; PP. 219; BIBL. 4 REF.Article

OPERATIONS SUR DES OPERATEURS TYPES.DESCLES P.1976; C.R. ACAD. SCI., A; FR.; DA. 1976; VOL. 283; NO 14; PP. 987-990; ABS. ANGL.; BIBL. 8 REF.Article

L'EXISTENCE D'ESPACES INFORMATIQUESLE BERRE F; NOLIN L.1981; C.R. SEANCES ACAD. SCI., SER. 1; FRA; DA. 1981; VOL. 292; NO 9; PP. 499-502; ABS. ENG; BIBL. 5 REF.Article

OBSERVATIONS ABOUT THE DEVELOPMENT OF THEORETICAL COMPUTER SCIENCEHARTMANIS J.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 224-233; BIBL. 29 REF.Conference Paper

ON THE UNIFORM HALTING PROBLEM FOR TERM REWRITING SYSTEMS.HUET G; LANKFORD D.1978; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1978; NO 283; PP. 1-7; ABS. FR.; BIBL. 3 REF.Serial Issue

CATEGORIES OF CHAIN-COMPLETE POSETS.MARKOWSKY G.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977; VOL. 4; NO 2; PP. 125-135; BIBL. 13 REF.Article

UNE CARACTERISATION DES FONCTIONS SEQUENTIELLES ET DES FONCTIONS SOUS-SEQUENTIELLES EN TANT QUE RELATIONS RATIONNELLES.CHOFFRUT C.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977 PARU 1978; VOL. 5; NO 3; PP. 325-337; BIBL. 6 REF.Article

A CHARACTERIZATION OF WEAKEST PRECONDITIONS.WAND M.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 15; NO 2; PP. 209-212; BIBL. 2 REF.Article

A FUNDAMENTAL EFFECT IN COMPUTATIONS ON REAL NUMBERS.LUCKHARDT H.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977 PARU 1978; VOL. 5; NO 3; PP. 321-324; BIBL. 3 REF.Article

UN SYSTEME COMPLET DE DEDUCTION NATURELLE.LUYA B.1975; ; S.L.; DA. 1975; PP. (69P.); BIBL. 1 P. 1/2; (THESE DOCT. 3E CYCLE, SPEC. MATH., MENTION INF. ALGEBRIQUE; PARIS VII)Thesis

Symbolic and Numerical AlgorithmsKOTSIREAS, Ilias S; MOURRAIN, Bernard; PAN, Victor Y et al.Theoretical computer science. 2011, Vol 412, Num 16, issn 0304-3975, 103 p.Serial Issue

3rd International Conference on Langage and Automata Theory and Applications (LATA 2009)MARTIN-VIDE, Carlos; TRUTHE, Bianca.Information and computation (Print). 2011, Vol 209, Num 3, issn 0890-5401, 382 p.Conference Proceedings

Logical and Semantic Frameworks with Applications (LSFA 2008 and 2009)AYALA-RINCON, Mauricio; PIMENTEL, Elaine; KAMAREDDINE, Fairouz et al.Theoretical computer science. 2011, Vol 412, Num 37, issn 0304-3975, 118 p.Serial Issue

Security and Cryptography FoundationsYUNG, Moti.Theoretical computer science. 2010, Vol 411, Num 10, issn 0304-3975, 78 p.Conference Proceedings

  • Page / 380